Improving the Hopfield-Tank approach for the traveling salesman problem

摘要

In this work we revisit the Hopfield-Tank algorithm for the travelingsalesman problem (TSP) and report encouraging results, with a differentdynamics, that makes the algorithm more efficient finding better solutions inmuch less computational time.